Precoloring Extension III: Classes of Perfect Graphs
نویسندگان
چکیده
منابع مشابه
Precoloring Extension 3: Classes of Perfect Graphs
We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some classes of perfect graphs, giving good characterizations (ne...
متن کاملPrecoloring Extension. Ii. Graphs Classes Related to Bipartite Graphs
We continue the study of the following general problem on vertex col-orings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this \precoloring" be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some graph classes which are related to bipartite graphs, giving...
متن کاملPrecoloring Extension . Ii . Graphs Classes Related to Bipartite Graphsm
We continue the study of the following general problem on vertex col-orings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this \precoloring" be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some graph classes which are related to bipartite graphs, giving...
متن کاملPrecoloring extension. I. Interval graphs
of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this precoloring be extended to a proper coloring of G with at most k colors (for some given k)? This question was motivated by practical problems in scheduling and VLSI theory. Here we investigate its complexity status for interval graphs and for graphs wit...
متن کاملPrecoloring extension on chordal graphs
In the precoloring extension problem (PrExt) we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. 1-PrExt is the special case where every color is assigned to at most one vertex in the precoloring. Answering an open question of Hujter and Tuza [HT96], we show that the 1-PrExt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 1996
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548300001826